Asymptotic loss probability in a finite buffer fluid queue with hetergeneous heavy-tailed on--off processes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Loss Probability in a Finite Buffer Fluid Queue with Heterogeneous

Consider a fluid queue with a finite buffer B and capacity c fed by a superposition of N independent On–Off processes. An On–Off process consists of a sequence of alternating independent periods of activity and silence. Successive periods of activity, as well as silence, are identically distributed. The process is active with probability p and during its activity period produces fluid at consta...

متن کامل

Finite buffer queue with generalized processor sharing and heavy-tailed input processes

We consider a set of N fluid On–Off flows that share a common server of capacity c and a finite buffer B. The server capacity is allocated using the generalized processor sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long-term average demand qi. The buffer sharing is unrestricted as long as there is available space. If the buffer is full, the nec...

متن کامل

On the Asymptotic Behavior of a Fluid Queue With a Heavy-Tailed M/G/∞ Arrival Process

We consider an infinite buffer fluid queue with a constant capacity and an M/G/∞ arrival process. M/G/∞ process consists of sessions with Poisson starting times, independent intermediately regularly varying session durations and constant arrival rates. The session duration distributions and arrival rates are selected from a finite set of distinct choices. For this queue we derive the asymptotic...

متن کامل

Asymptotic Behavior of the Loss Probability for a Feedback Finite Fluid Queue with Downward Jumps

We consider a feedback finite fluid queue (FFFQ, for short) with downward jumps, where the fluid flow rate and the jump size are controlled by a background Markov chain with a finite state space. The ”feedback” means that the background process may change according to the level of the buffer, which is used for modeling TCP/IP flow. The matrix analytic technique has been successsfully applied to...

متن کامل

A Finite Buffer Fluid Queue Driven by a Markovian Queue

We consider a finite buffer fluid queue receiving its input from the output of a Markovian queue with finite or infinite waiting room. The input flow into the fluid queue is thus characterized by a Markov modulated input rate process and we derive, for a wide class of such input processes, a procedure for the computation of the stationary buffer content of the fluid queue and the stationary ove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 2003

ISSN: 1050-5164

DOI: 10.1214/aoap/1050689595